Solving maximum independent set by asynchronous distributed hopfield-type neural networks
نویسندگان
چکیده
منابع مشابه
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysi...
متن کاملSolving Sudoku Puzzles by using Hopfield Neural Networks
In this paper two different approaches to solve Sudoku puzzles with neural networks are presented. The first approach is proposed by J.J. Hopfield. He tries to solve the Sudoku puzzle with help of a Hopfield network and treated the problem as an integer optimization problem that is also used for the solution of the well known Traveling Salesmen Problem (TSP). Second solution uses the Hopfield n...
متن کاملFixed Points of Hopfield Type Neural Networks
The set of the fixed points of the Hopfield type network is under investigation. The connection matrix of the network is constructed according to the Hebb rule from the set of memorized patterns which are treated as distorted copies of the standard-vector. It is found that the dependence of the set of the fixed points on the value of the distortion parameter can be described analytically. The o...
متن کاملDistributed Approximation of Maximum Independent Set and Maximum Matching
We present a simple distributed ∆-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS(G) · logW ) rounds, where ∆ is the maximum degree, MIS(G) is the number of rounds needed to compute a maximal independent set (MIS) on G, and W is the maximum weight of a node. Plugging in the best known algorithm for MIS gives a randomized solution ...
متن کاملTabu search for solving optimization problems on Hopfield neural networks
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP-hard in heuristic approach. A Hoppeld-type neural network is a method that is often used to solve problems such as Traveling Salesman Problem. However, it is diicult to nd an optimal solution because it is based on gradient descent and its energy function has many l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2006
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2006012